Methods and devices for coding and decoding a data stream representative of at least one image

ABSTRACT

A method and device for encoding and a method and device for decoding a signal including encoded data representing an image sub-divided into blocks, and information representing a correction block and a residual block. For a current block of the image, a first pixel is encoded from a prediction value obtained for the first pixel from at least one pixel of a previously rebuilt block. The prediction is corrected using at least one value of a pixel of the correction block. At least one current pixel of the current block is encoded from a prediction value obtained for the current pixel from at least one previously corrected pixel of the current block. The prediction is corrected by using at least one value of a pixel of the correction block, delivering a prediction block for the current block. The residual block is computed from the current block and the predictive block.

1. CROSS-REFERENCE TO RELATED APPLICATIONS

This Application is continuation of U.S. application Ser. No.16/617,275, filed Nov. 26, 2019, which is a Section 371 National StageApplication of International Application No. PCT/FR2018/051210, filedMay 18, 2018, and published as WO 2018/220311 A1 on Dec. 6, 2018, not inEnglish, the entire contents of which are hereby incorporated reference.

2. FIELD OF THE INVENTION

The field of the invention is that of the encoding and decoding ofimages or image sequences, especially video streams.

More specifically, the invention relates to the compression of images orsequences of images using a blockwise representation of the images.

The invention can be applied especially to image or video encodingimplemented present-day or future encoders (under the JPEG, MPEG, H.264,HEVC and other standards, and their amendments), and to thecorresponding decoding.

3. PRIOR ART

Digital images and image sequences occupy a great deal of memory space.This makes it necessary to compress these images when they aretransmitted in order to avoid problems of congestion in the network usedfor this transmission. Indeed, the bit rate that can be used on thisnetwork is generally limited.

There are numerous known techniques of video data compression. Theseinclude the HEVC (“High Efficiency Video Coding, Coding Tools andSpecification”, Matthias Wien, Signals and Communication Technology,2015) compression standard which proposes to implement a prediction ofpixels of a current image relative to other pixels belonging to the sameimage (intra prediction) or belonging to a preceding or following image(inter prediction).

More specifically, intra prediction exploits spatial redundancies withinan image. To this end, the images are sub-divided into blocks of pixels.The blocks of pixels are then predicted by means of already rebuiltinformation corresponding to previously encoded/decoded blocks in thecurrent image according to the order of scanning of the blocks in theimage.

Besides, classically, the encoding of a current block is carried out bymeans of a prediction of the current block, called a predictive block,and of a prediction residue or “residual block” corresponding to adifference between the current block and the predictive block. Theresidual block obtained is then transformed, for example by using a DCT(discrete cosine transform) type transform. The coefficients of thetransformed residual block are then quantified, then encoded by entropicencoding and transmitted to the decoder which can rebuild the currentblock by adding this residual block to the predictive block.

The decoding is done image by image and, for each image, it is doneblock by block. For each block, the corresponding elements of the streamare read. The inverse quantification and inverse transformation of thecoefficients of the residual block are performed. Then, the predictionof the block is computed to obtain the predictive block, and the currentblock is rebuilt by adding the prediction (i.e. the predictive block) tothe decoded residual block.

Classically, the intra prediction of a current block is done by usingreference pixels of previously rebuilt blocks in the image. Such asituation is illustrated in FIG. 1 , in which the reference pixels usedto predict the pixels (X(i,j)_(i=0,1,2,3 and j=0,1,2,3)) of a currentblock X correspond generally to the pixels situated on the line justabove the current block (pixels identified by T(−1, i)_(i=−1,0,1,2,3))and the pixels situated on the column to the left of the current block(pixels identified by T(i, −1)_(i=−1,0,1,2,3)).

For example, the HEVC standard defines 35 intra prediction modes usingsuch reference pixels, these prediction modes differing from one anotherby the way in which these reference pixels are used to build apredictive block for the current block.

It can be seen that according to such an intra prediction technique, thepixels situated on the first row and the first column of the predictiveblock are very well predicted because they are immediately adjacent tothe reference pixels. Indeed, the closer the pixels are to each other inspace, the greater the extent to which the information that they containis correlated.

By contrast, the pixels of the predictive block, which are situated atthe bottom right-hand side, i.e. far from the reference pixels, forexample the pixel X(3,3) illustrated in FIG. 1 , are not accuratelypredicted. Such pixels then provide a prediction residue with highenergy and therefore a higher bit rate is needed to encode them.

There is therefore a need for a novel technique for building predictiveblocks to predict a current block, improving the compression of theimage or video data.

4. SUMMARY OF THE INVENTION

The invention improves on the prior art. It relates to a method fordecoding an encoded data stream representative of at least one imagesub-divided into blocks. The decoding method comprises the followingsteps, for at least one current block of the image:

-   -   decoding, from the encoded data stream, at least one piece of        information representative of a block, called a correction        block, and a residual block,    -   determining the correction block from the decoded information,    -   determining a predictive block from the current block        comprising:        -   for at least one first pixel of the current block:            -   obtaining a prediction value of said first pixel from at                least one pixel of a previously rebuilt block of the                image,            -   correcting said first pixel by adding, to the prediction                value obtained for the first pixel, at least one value                of a pixel of the correction block,        -   for at least one current pixel of the current block,            distinct from the first pixel:            -   obtaining a prediction value of said current pixel from                at least one previously corrected pixel of the current                block,            -   correcting said current pixel by adding, to said                prediction value obtained for the current pixel, at                least one value of a pixel of said correction block,    -   rebuilding said current block on the basis of the predictive        block and of the decoded residual block.

Correlatively, the invention relates to a method for encoding at leastone image in the form of an encoded data stream, said image beingsub-divided into blocks and comprising the following steps for at leastone current block of the image to be encoded:

-   -   determining a predictive block of the current block comprising:        -   for at least one first pixel of the current block:            -   obtaining a prediction value of said first pixel on the                basis of at least one pixel of a previously rebuilt                block of the image,            -   correcting said first pixel by adding, to the prediction                value obtained for said first pixel, at least one value                of a pixel of a block, called a correction block,        -   for at least one current pixel of the current block,            distinct from the first pixel:            -   obtaining a prediction value of said current pixel from                at least one previously corrected pixel of the current                block,            -   correcting said current pixel by adding, to the                prediction value obtained for the current pixel, at                least one value of a pixel of said correction block,    -   encoding, in the data stream, of at least one piece of        information representative of said correction block,    -   computing a residual block from said current block and said        determined predictive block,    -   encoding said residual block in the data stream.

According to the invention, the prediction of a current pixel of acurrent block is thus improved. Indeed, it is thus possible to predict acurrent pixel of the current block by a pixel of the current block thathas previously been corrected. In particular, for a current pixel thatis spatially distant from the reference pixels of the current block,i.e. the reference pixels corresponding to the pixels situated justabove the current block and to the left of the current block, it is thuspossible to predict such a current pixel by pixels of the current blockthat are closer to this current pixel. Since the prediction of thepixels is improved, the prediction residue between the current block andthe predictive block is smaller and the coding cost of the current blockis reduced.

According to the invention, an encoding residue for the current block istransmitted in the data stream and added to the predictive block torebuild the current block, thus improving compression performance.

According to another particular embodiment of the invention, thecorrection block comprises predetermined residual data.

According to another particular embodiment of the invention, thecorrection block belongs to a set of predetermined data blocks, said atleast one piece of information representative of said correction blockenabling the identification of said correction block from among theblocks of the set. According to this particular embodiment of theinvention, a dictionary of residue data blocks is available to theencoder and the decoder. For a current block to be encoded or decoded,the correction block is selected from the blocks of the dictionary. Forexample, the block of the dictionary providing the bestbitrate/distortion trade-off to encode the current block is selected asa correction block for the current block.

According to another particular embodiment of the invention, theprediction value of the current pixel is obtained from at least onepreviously corrected pixel of the current block as a function of a localprediction function applied to the pixel situated above the currentpixel, the pixel situated to the left of the current pixel and the pixelsituated at the top left of the current pixel. According to thisparticular embodiment of the invention, a current pixel is predictedthrough a causal and local neighborhood of this pixel. The correlationbetween the current pixel and the reference pixels used to predict thecurrent pixel is thus higher than it is with classic intra predictionmethods.

According to another particular embodiment of the invention, a piece ofinformation representative of the local prediction function is encodedin or decoded from the encoded data stream. According to this particularembodiment, different local prediction functions can be used to predictthe pixels of a current block. It is thus possible to select and signal,to the decoder, the most efficient local prediction function forpredicting the pixels of a current block.

According to another particular embodiment of the invention, the encodeddata stream comprises, for the current block, a piece of informationindicating whether the current block is encoded according to aprediction mode using only pixels belonging to previously rebuilt blocksof the image or whether the current block is encoded according to aprediction mode using at least one previously corrected pixel of thecurrent block. According to this particular embodiment, the data streamcomprises a piece of information indicating whether the current block isencoded for example according to a directional intra prediction mode asis known in existing compression standards or according to the new intraprediction mode of any one of the particular embodiments mentioned hereabove. Thus, it is possible, for each block of the image, to choose thebest intra prediction mode in terms of bitrate/distortion.

The invention also relates to a signal comprising encoded datarepresentative of at least one image, sub-divided into blocks. Such asignal comprises, for at least one current block of the image, at leastone piece of information representative of a block called a correctionblock, at least one first pixel of the current block being encoded fromat least one value of a pixel of the correction block and a predictionvalue obtained for said first pixel from at least one pixel of apreviously rebuilt block of the image, and at least one current pixel ofthe current block being encoded from at least one value of a pixel ofthe correction block and from a prediction value obtained for saidcurrent pixel from at least one previously corrected pixel of thecurrent block, delivering a predictive block for the current block. Thesignal also comprises at least one piece of information representativeof a residual block computed from the current block and of thepredictive block.

According to one particular embodiment of the invention, the signalfurthermore comprises, for the current block, a piece of informationindicating whether the current block is encoded according to aprediction mode using only pixels belonging to previously rebuilt blocksof the image or whether the current block is encoded according to aprediction mode using at least one previously corrected pixel of thecurrent block.

The invention also relates to a decoding device configured to implementthe decoding method according to any one of the particular embodimentsdefined here above. This decoding device could of course comprise thedifferent characteristics relative to the decoding method according tothe invention. Thus, the characteristics and advantages of this decodingdevice are the same as those of the decoding method and are notdescribed in more ample details.

According to one particular embodiment of the invention, such a decodingdevice is comprised in a terminal.

The invention also relates to an encoding device configured to implementthe encoding method according to any one of the particular embodimentsdefined here above. This encoding device could of course comprise thedifferent characteristics of the encoding method according to theinvention. Thus, the characteristics and advantages of this encodingdevice are the same as those of the encoding method, and are notdescribed in more ample details.

According to one particular embodiment of the invention, such anencoding device is comprised in a terminal, or a server.

The decoding method and the encoding method respectively, according tothe invention, can be implemented in a variety of ways, especially inwired or software form.

According to one particular embodiment of the invention, the decodingmethod and the encoding method respectively are implemented by acomputer program. The invention also relates to a computer programcomprising instructions to implement the method of decoding or themethod of encoding according to any one of the particular embodimentsdescribed here above when said program is executed by a processor. Sucha program can use any programming language whatsoever. It can bedownloaded from a communications network and/or recorded on acomputer-readable medium or carrier.This program can use any programming language whatsoever and can be inthe form of source code, object code or intermediate code between sourcecode and object code such as in a partially compiled form or in anyother desirable form whatsoever.The invention is also aimed at providing an information carrier ormedium readable by a computer, and comprising instructions of a programas mentioned here above. The information carriers mentioned here abovecan be any entity or device whatsoever capable of storing the program.For example, the carrier or medium can comprise a storage means such asa ROM, for example, a CD ROM or microelectronic circuit ROM or again amagnetic recording means, for example a floppy disk or a hard diskdrive. Besides, the information medium can correspond to a transmissiblemedium such as an electrical or optical signal, that can be conveyed byan electrical or optical cable, by radio or by other means. The programaccording to the invention can be especially downloaded from an Internettype network.

As an alternative, the recording supports can correspond to anintegrated circuit into which the program is incorporated, the circuitbeing adapted to executing or to being used in the execution of themethod in question.

5. LIST OF FIGURES

Other features and advantages of the invention shall appear more clearlyfrom the following description of several particular embodiments, givenby way of simple illustratory and non-exhaustive examples and from theappended drawings, of which:

FIG. 1 illustrates the position of the reference pixels according to theprior art to predict the pixels of a current block,

FIG. 2 illustrates a method for determining a predictive block accordingto one particular embodiment of the invention,

FIG. 3 illustrates examples of position of the reference pixels used topredict pixels of a current block according to one particular embodimentof the invention,

FIG. 4 presents steps of the encoding method according to one particularembodiment of the invention,

FIG. 5 presents steps of the decoding method according to one particularembodiment of the invention,

FIG. 6 presents the simplified structure of an encoding device adaptedto implement the encoding method according to any one of the particularembodiments of the invention,

FIG. 7 presents the simplified structure of the decoding device adaptedto implement the decoding method according to any one of the particularembodiments of the invention,

FIG. 8A illustrates an example of a signal comprising encoded datarepresentative at least one block of an image according to oneparticular embodiment of the invention,

FIG. 8B illustrates an example of a signal comprising encoded datarepresentative at least one block of an image according to anotherembodiment of the invention.

6. DESCRIPTION OF ONE EMBODIMENT OF THE INVENTION 6.1 General Principle

The general principle of the invention is aimed at improving theprediction of the pixels of a block to be encoded of an image, situatedfar from the reference pixels classically used for the prediction of ablock.

To this end, a prediction of these pixels is implemented by the use ofpixels of the current block itself which have been previously correctedby means of a residual data block. Such a residual data block isdifferent from an encoding residual block known from the classic methodsof encoding by prediction. According to the invention, the residue datablock, also called a correction block, comprises residue data used tocorrect the value of the pixels of the current block which serve topredict the following pixels of the current block. Indeed, the pixels ofthe current block, which serve to predict the following pixels of thecurrent block, have themselves been predicted by previously correctedpixels of the current block and/or pixels of a previously rebuilt blockof the image, but for which the prediction residue has not yet beencomputed or encoded/decoded. According to the invention, pixels of thecurrent block are predicted by other pixels also belonging to thecurrent block that have not yet been rebuilt, i.e. by means of anencoded/decoded prediction residue but which have been corrected bymeans of a correction block available to the encoder and to the decoder.

The term “value of a pixel” is understood here to mean the value of acomponent of the image to be encoded for the pixel. For example, in thecase of a representation of the image to be encoded, in the form of aluminance component Y, and with two chrominance components U and V, themethod of prediction can be applied to each component, or only to one ofthem. The invention is obviously not limited to the YUV representationand can be applied similarly to other representations of the image (RGB,YCbCr, etc.).

We present first modes of implementation of the determining of apredictive block for a current block according to the invention, andthen a method for encoding a sequence of images and a method fordecoding a data stream, both using such a determining of a predictiveblock for predicting a current block of the image, according to oneparticular embodiment of the invention, as well as correspondingencoding and decoding devices.

6.2 Determining a Predictive Block for Predicting a Current BlockAccording to One Particular Embodiment of the Invention

FIG. 2 illustrates the determining of a predictive block b_(pred)serving to predict a current block X of an image to be encoded.

For each pixel X_(i) of the current block X, illustrated in FIG. 3 bymeans of thick lines, a prediction value of the pixel X_(i) isdetermined during a step E20. To this end, a local prediction functionH(A_(i), B_(i), C_(i),) is used. Such a function H(A_(i), B_(i), C_(i),)computes a prediction value P_(i) of a pixel X_(i) from the value of thepixels A_(i), B_(i), C_(i). According to the particular embodiment ofthe invention described herein, the pixels A_(i), B_(i), C_(i)correspond respectively to the pixel situated to the left of the pixelX_(i), to the top of pixel X_(i) and to the top left of the pixel X_(i).

The local prediction function H(A_(i), B_(i), C_(i),) for example hasthe form:

$P_{i} = {{H\left( {A_{i},B_{i},C_{i}} \right)} = \left\{ \begin{matrix}{{\min\mspace{11mu}\left( {A_{i},B_{i}} \right)\mspace{14mu}{if}\mspace{14mu} C_{i}} > {\max\mspace{14mu}\left( {A_{i},B_{i}} \right)}} \\{{\max\mspace{11mu}\left( {A_{i},B_{i}} \right)\mspace{14mu}{if}\mspace{14mu} C_{i}} < {\min\mspace{14mu}\left( {A_{i},B_{i}} \right)}} \\{A_{i} + B_{i} - {C_{i}\mspace{14mu}{else}}}\end{matrix} \right.}$

As a variant, other types of local prediction functions can be used, forexample

${H\left( {A_{i},B_{i},C_{i}} \right)} = {\frac{{A_{i} + B_{i} + C_{i}}\mspace{14mu}}{3}.}$

The local prediction function H(A_(i), B_(i), C_(i),) can be known tothe encoder and to the decoder, or else transmitted in the encoded datastream, at the encoded data of an image or the sequence of images.

Depending on the position of the pixel X_(i) in the current block X, thelocal prediction function uses pixels A_(i), B_(i), C_(i) that canbelong to previously rebuilt blocks of the image and/or belonging to thecurrent block X

For example, for the pixel X₁ of FIG. 3 , the prediction value isdetermined from the pixels A₁, B₁ and C₁, i.e. solely by means ofreference pixels belonging to previously rebuilt blocks of the image,and more specifically to the blocks situated above, to the left and tothe top-left of the current block.

For the pixel X₂ of FIG. 3 , the prediction value is determined from thepixels A₂, B₂ and C₂, i.e. by means of reference pixels belonging to apreviously rebuilt blocks of the image and by means of pixels belongingto the current block.

For the pixel X₃ of FIG. 3 , the prediction value is determined from thepixels A₃, B₃ and C₃, i.e. solely by means of pixels belonging to thecurrent block.

In general, and with notations referring to FIG. 1 , for a pixel X(lin,col) of the current block X, where lin represents the index of the rowof the pixel X relative to the upper left-hand corner of the block X andcol represents the index of the column of the pixel X relative to theupper left-hand corner of the block X, the prediction value G(lin, col)is obtained by:

G(lin, col) = H(T(0, −1), T(−1, 0), T(−1, −1))  if  lin = 0  and  col = 0, G(lin, col) = H(T(lin, −1), P_(k)(lin − 1, 0), T(lin − 1, −1)), if  lin > 0  and  col = 0, G(lin, col) = H(P_(k)(0, col − 1), T(−1, col), T(−1, col − 1)), if  lin = 0  and  col > 0, G(lin, col) = H(P_(k)(lin, col − 1), P_(k)(lin − 1, col), P_(k)(lin − 1, col − 1), if  lin > 0  and  col > 0with T(lin, col) a pixel belonging to a previously rebuilt block, H isthe local prediction function and P_(k)(x,y) is the prediction value ofa pixel X(x,y) that belongs to the current block X and has beenpreviously corrected by a correction block V_(k)described here below.

At the end of the step E20, a prediction value G(lin, col) is obtainedfor the current pixel X(lin, col).

During a step E21, the prediction value G(lin, col) is corrected bymeans of a value of a correction block V_(k) for the pixel X(lin, col).The correction block V_(k)is a residual data block comprising forexample values between −255 and +255 when the values of pixelsrepresented on 8 bits.

According to one particular embodiment of the invention, the correctionblock V_(k) belongs to a set or dictionary of predetermined residualdata blocks {V_(k)}_(k=0 . . . N), N being the number of blocks of theset.

For example, such a dictionary comprises a subset of all the possiblecombinations of values of residues, the subset being selected forexample by learning from a group of images and/or being transmitted withthe encoded data stream.

For example, it is considered in this example that the pixels of theimage are encoded on 8 bits and each pixel of a correction block cannegatively or positively correct a prediction value which is itselfrepresented on 8 bits. Such a pixel of a correction block must then havea dynamic range of 9 bits. Hence, for a correction block sized 8×8pixels for example, the number of possible blocks is 2^(9×64). It wouldthen be necessary to encode a large amount of information to identifythe correction block chosen from among all the possible combinations ofvalues of residues. In addition, the search for the best correctionblock would be very costly in terms of computation.

In practice, dictionary sizes comprising for example 32 to 512correction blocks allow to obtain an optimal compression, i.e. a highgain in quality for reduced information transmission. It is howevernecessary to choose the blocks of the dictionary well so that suchcorrection blocks are representative of the blocks truly useful formaking a correction of the pixels of the current block.

According to the example described here, the dictionary{V_(k)}_(k=0 . . . N) is built as a subset of correction blocks among avast set of correction blocks comprising all the possible correctionblocks, i.e. comprising all the combinations of values of residuespossible. According to a first variant, to build this dictionary{V_(k)}_(k=0 . . . N), a classic building technique that uses theLinde-Buzo-Gray algorithm (i.e. the LBG algorithm) is used as describedin Linde, Y.; Buzo, A.; Gray, R. (1980). “An Algorithm for VectorQuantizer Design”. IEEE Transactions on Communications. 28: 84.doi:10.1109/TCOM.1980.1094577. This technique uses a sequence forlearning pixel blocks to be corrected, and an initial dictionary, forexample chosen at random. This technique then iterates two steps:

-   -   a first step which, for each block of the learning sequence,        determines the best correction block of the dictionary as        understood in terms of a predetermined criterion, for example        the distortion generated by the use of the correction block        during the prediction of the pixels of the current block of the        learning sequence. The learning blocks are divided into classes,        each class being the set of learning blocks associated with a        correction block of the dictionary.    -   for each class, a new correction block is determined so that        this block improves the predetermined criterion for said class.        The dictionary block associated with the class is then replaced        by this new block.

Other methods known to those skilled in the art for building aquantification dictionary are possible, such as for example the“Pairwise Nearest Neighbor” approach described in “Vector Quantizationand Signal Compression” by Allen Gersho and Robert M. Gray, The SpringerInternational Series in Engineering and Computer Science Series Volume159 Springer US.

Preferably, the correction block V_(k) has a size identical to that ofthe current block.

In one particular embodiment of the invention, a same correction blockis used for all the pixels of the current block.

During the step E21, the value of the correction block V_(k)(lin, col)is added to the prediction value G(lin, col) obtained for the pixelX(lin, col), to obtain the corrected prediction value P_(k)(lin, col) ofthe pixel X(lin, col): P_(k)(lin, col)=G(lin, col)+V_(k)(lin, col).

During a step E22, it is checked if all the pixels of the current blockhave been predicted. If this is the case (Y in FIG. 2 ), a predictiveblock b_(pred) associated with the correction block V_(k) comprising,for each pixel X(lin, col), a corrected prediction value P_(k)(lin, col)is available to encode or rebuild the current block. Else (N in FIG. 2), the operation passes to the prediction of the next pixel of thecurrent block by iterating the steps E20 and E21 for the next pixel.

6.3 Encoding Method

FIG. 4 presents the steps of the method for encoding a sequence ofimages I₁, I₂, . . . , I_(Nb) to be encoded in the form of an encodeddata stream STR according to one particular embodiment of the invention.For example, such an encoding method is implemented by an encodingdevice as described with reference to FIG. 6 .

An image sequence I₁, I₂, . . . , I_(Nb), Nb being the number of imagesof the sequence to be encoded, is provided at input to the encodingmethod. The encoding method outputs an encoded data stream STRrepresentative of the image sequence given at input.

In a known way, the encoding of the image sequence I₁, I₂, . . . ,I_(Nb) is done image by image according to an encoding order that ispreset and known to the decoder. For example, the images can be encodedin the temporal order I₁, I₂, . . . , I_(Nb) or according to any otherorder, for example I₁, I₃, I₂, . . . , I_(Nb).

In a step E0, an image I_(j) to be encoded of the image sequence I₁, I₂,. . . , I_(Nb) is sub-divided into blocks, for example blocks sized32×32 or 64×64 pixels or more. Such a block can be sub-divided intosquare or rectangular sub-blocks, for example sized 16×16, 8×8, 4×4,16×8, 8×16, etc.

Then, during the step E0, a block or sub-block X to be encoded of animage I_(j)(1≤j≤Nb) is selected according to a predetermined directionof scanning of the image I_(j).

It is assumed here that the block X is encoded according to an intraencoding mode. Among the intra encoding modes available, it is assumedthat the block X can be encoded by means of a classic intra encodingmode, for example according to an intra encoding mode defined in theHEVC standard described in “Overview of the High Efficiency Video Coding(HEVC) Standard”, G.-J. Sullivan, J.-R. Ohm, W.-J. Han, T. Wiegand, IEEETransactions on Circuits and Systems for Video Technology, December2012, or else by means of intra encoding using a prediction as describedhere above with reference to FIGS. 2 and 3 . The encoding methoddescribed here applies of course to other modes of intra predictionavailable for encoding the current block X and is not limited solely tothe intra encoding modes described in the HEVC standard.

According to the particular embodiment described here, the best intraencoding mode for the block X will be selected by means ofbitrate/distortion costs associated with each intra encoding mode.

During a step E10, the best classic intra mode for encoding the block Xis determined. The classic intra prediction consists in predicting theset of pixels X(lin,col) of the current block by previously rebuiltpixels T(lin,col), where lin represents the index in the image of therow of the pixels relative to the upper left-hand corner of the block Xand col represents the index in the image of the column of the pixelsrelative to the upper left-hand corner of the block X as illustrated inFIG. 1 . The previously rebuilt pixels T(lin,col) are interpolated by aninterpolation function chosen from a set of functions {F_(m)} where thevalue of m ranges from 0 to M-1, M being the number of intra modes foreach pixel X(lin,col), the predicted value P(lin,col) is given byP(lin,col)=F_(m)(T,lin,col), where m is the index of the intraprediction mode.

Thus, according to the HEVC standard, the mode M=1 consists in assigningeach predicted pixel P(lin,col) the mean value of the previously rebuiltpixels T(lin,col). The modes indexed m>1 are directional interpolationsin 33 different directions from the pixels T(lin,col) previouslyrebuilt.

During the step E10, the best possible prediction among the classicintra prediction modes m, m=0,M-1 is determined.

To this end, for each prediction mode m ranging from 0 to M-1:

-   -   during a sub-step E101, the predictive block P_(m) is built by        applying the corresponding prediction function to each pixel of        the current block X: P_(m)(lin,col)=F_(m)(T, lin, col),    -   during a sub-step E102, the prediction residue Res_(m) of the        current block X for the mode m is computed for each pixel of the        current block X, by Res_(m)(lin, col)=X(lin,col)−P_(m)(lin,col),    -   classically, during a sub-step E103, the prediction residue is        transformed, for example by a DCT transform, and quantified,        delivering quantified coefficients Res^(q) _(m), and an encoding        cost R_(m) associated with the intra prediction mode m is        estimated from the quantified coefficients Res^(q) _(m) and from        the cost for signaling the intra prediction mode m,    -   during a sub-step E104, the prediction residue Res^(rec) _(m) is        rebuilt by inverse quantification and inverse transform of the        quantified coefficients Res^(q) _(m),    -   during a sub-step E105, the current block X^(rec) _(m) is        rebuilt by X^(rec) _(m)=Res^(rec) _(m)+P_(m),    -   during a sub-step E106, the distortion D_(m) between the current        block X and the rebuilt current block X^(rec) _(m) associated        with the prediction mode intra m is computed: D_(m)=Dist(X,        X^(rec) _(m)), with Dist representing an error function, for        example a quadratic error function, and the bitrate/distortion        cost associated with the intra prediction mode m is computed:        J_(m)=R_(m)+λ×D_(m).

During a sub-step E107, the prediction module n giving the lowest bitrate/distortion cost J_(n) among all the bit rate/distortion costs J_(m)associated with the prediction mode m from 0 to M-1 is selected as thebest classic intra prediction mode. The prediction mode n, the pieces ofencoded information associated with the residue Res^(q) _(n) and therebuilt current block X^(rec) _(m) are stored for the subsequent part ofthe operation.

During a step E11, the cost of encoding an intra prediction mode asdescribed with reference to FIGS. 2 and 3 is determined in order to besubsequently compared with the best classic intra prediction mode. Forgreater clarity, the intra prediction mode as described with referenceto FIGS. 2 and 3 will be called a “mode with corrected prediction”.

During the step E11, the correction block V_(b) providing an encoding ofthe current block X for which the bit rate/distortion cost according tothe corrected prediction mode is the lowest is determined. To this end,for each correction block V_(k) of the set of correction blocks kranging from 0 to N-1, the following sub-steps are implemented:

-   -   during a sub-step E111, the predictive block P_(k) associated        with the correction block V_(k) is built by implementing the        steps 20 to 22 described with reference to FIG. 2 ,    -   during a sub-step E112, the prediction residue Res_(k) of the        current block X for the correction block V_(k) is computed for        each pixel of the current block X, by Res_(k)(lin, col)=X(lin,        col)−P_(k)(lin,col).    -   during a sub-step E113, the prediction residue is transformed,        for example by a DCT transform, and quantified delivering        quantified coefficients Res^(q) _(k), and the encoding cost        R_(k) associated with the correction block V_(k) is estimated        from the quantified coefficients and from the cost of signaling        the correction block V_(k). For example, the correction block        V_(k) is signaled to the decoder by the encoding of the index of        the correction block V_(k) among the set of correction blocks,    -   during a sub-step E114, the prediction residue Res^(rec) _(k) is        rebuilt by inverse quantification and inverse transform of the        quantified coefficients Res^(q) _(k),    -   during a sub-step E115, the current block X^(rec) is rebuilt by        X^(rec) _(k)=Res^(rec) _(k)+P_(k),    -   during a sub-step E116, the distortion D_(k) between the current        block X and the rebuilt current block X^(rec) _(k) associated        with the correction block V_(k) is computed:        D_(k)=Dist(X,X^(rec) _(k)), with Dist an error function, for        example a quadratic error function, and the bit rate/distortion        cost associated with the correction block V_(k) is computed:        J_(k)=R_(k)+λ×D_(k).

During a sub-step E117, the correction block V_(b) providing the lowestbit rate/distortion cost J_(k) associated with the correction blockV_(k), with k being a value ranging from 0 to N-1, is selected as thebest correction block. The index of the correction block V_(b) and theencoded information associated with the prediction residue Res_(b) arestored for the subsequent part of the operation.

During a step E12, the bit rate/distortion costs J_(n) and J_(b) of thetwo prediction modes respectively obtained during the step E10 andduring the step E11 are compared and the current block X is encodedaccording to the intra prediction mode providing the lowest bitrate/distortion cost.

During the step E12, a piece of information (TY) indicating the type ofintra prediction mode is encoded in the data stream STR as illustratedin FIGS. 8A and 8B. Such a piece of information indicates whether thecurrent block X is encoded according to a classic intra prediction mode,i.e. a prediction mode using only pixels belonging to previously rebuiltblocks of the image, or whether the current block X is encoded accordingto a mode with corrected prediction, i.e. a prediction mode using atleast one previously corrected pixel of the current block X.

If it is determined during the step E12 that the best intra predictionmode to encode the current block X is the classic intra prediction moden, then during a step E13, the prediction mode n is encoded in theencoded data stream STR and the quantified coefficients Res^(q) _(n)obtained for this prediction mode n are encoded in the encoded datastream STR by an entropic encoding module, for example a CABAC encoderdescribed in D. Marpe, H. Schwarz, T. Wiegand, “Context-based adaptivebinary arithmetic coding in the H.264/AVC video compression standard”IEEE Transactions on Circuits and Systems for Video Technology(Volume:13, Issue: 7), pages 620-636, July 2003.

If it is determined during the step E12 that the best intra predictionmode to encode the current block X is the mode with corrected predictionusing the correction block V_(b), then during the step E13, a piece ofinformation representative of the correction block V_(b) is encoded inthe encoded data stream STR, for example the index “b” of the correctionblock V_(b) in the dictionary of correction blocks. Such an index is forexample encoded by a code with fixed or variable length. The quantifiedcoefficients Res^(q) _(b) obtained during the step E113 for thecorrection block V_(b) are then encoded in the encoded data stream STRby an entropic encoding module, for example a CABAC encoder. One exampleof a signal resulting from the encoding of the current block X accordingto the mode with corrected prediction is illustrated in FIG. 8A.

According to one particular embodiment of the invention, a piece ofinformation representative of the local prediction function H(A_(i),B_(i), C_(i),) used for the mode with corrected prediction is encoded inthe encoded data stream STR as illustrated in FIG. 8B. According to thisparticular embodiment of the invention, such a piece of information canbe encoded at the image level. Thus, the same local prediction functionis used for all the blocks of the image when they are encoded accordingto the mode with corrected prediction. Or else, such a piece ofinformation can be encoded at the block level, and thus the localprediction function can be adapted to each block, and the localprediction function providing the best bit rate/distortion cost can beselected.

At a step E14, it is verified that all the blocks of the image to beencoded I_(j) have been encoded. If not (N), the encoding method returnsto the step E10 by proceeding to the selection of the next blockaccording to a predetermined scan of the image to be encoded.

If all the blocks of the image have been processed, then at a step E15,an image I_(j) ^(rec) is rebuilt from the rebuilt blocks X^(rec) of theimage and saved in a list of reference images to be used subsequently asa reference during the encoding of the following images of the sequenceof images. The encoding method then returns to the step E0 to processthe following images of the sequence of images according to the encodingorder.

6.4 Decoding Method

FIG. 5 presents steps of a method for decoding a stream STR of encodeddata representing a sequence of images I₁, I₂, . . . , I_(Nb) to bedecoded according to one particular embodiment of the invention.

For example, the data stream STR has been generated through the encodingmethod presented with reference to FIG. 4 . The data stream STR isprovided at input of a decoding device DEC as described with referenceto FIG. 7 .

The decoding method carries out the decoding of the stream image byimage and each image is decoded block by block.

For a block X of an image to be rebuilt, during the step E50, the dataof the data stream STR corresponding to the block X are decoded by anentropic decoding module to provide on the one hand syntax elementsrelating to the encoding mode for the current block X and on the otherhand coefficients of prediction residues Res^(q) _(b) of the currentblock X.

According to one particular embodiment of the invention, the decodedsyntax elements comprise notably a piece of information (TY) indicatingwhether the current block X is encoded according to a classic intraprediction mode, i.e. a prediction mode using only pixels belonging topreviously rebuilt blocks of the image, or whether the current block Xis encoded according to a corrected prediction mode, i.e. a predictionmode using at least one previously corrected pixel of the current blockX.

It is assumed here that the current block X is encoded according to amode with corrected prediction.

The syntax elements decoded during the step E50 also comprise a piece ofinformation “b” representative of a correction block V_(b) belonging toa dictionary of correction blocks available at the decoder DEC.

At a step E501, the correction block V_(b) is determined from thedecoded information “b”. The correction block V_(b) is identified amongthe correction blocks of the dictionary available at the decoder DEC.For example, such correction blocks are stored in a memory of thedecoder DEC.

At a step E51, the coefficients of prediction residues of the block Xundergo an inverse quantification, and then an inverse transform to givea decoded prediction residue Res^(q) _(b) ^(rec).

At a step E52, a predictive block P_(b) associated with the correctionblock V_(b) is built by implementing the steps 20 to 22 described withreference to FIG. 2 .

According to one particular embodiment of the invention, the decodedsyntax elements decoded during the step E50 also comprise a piece ofinformation representative of a local prediction function H(A_(i),B_(i), C_(i),) used for the mode with corrected prediction. Such a pieceof information can be decoded at the level of the image syntax elementsor for the current block X. Such a piece of information representativeof a local prediction function H(A_(i), B_(i), C_(i),) can be an indexof a function from among a list of prediction functions known to theencoder and the decoder. According to this particular embodiment of theinvention, the decoded local prediction function H(A_(i), B_(i), C_(i),)of the encoded data stream STR is used by the method for determining apredictive block described with reference to FIG. 2 during the step E52.

During a step E53, the current block X^(rec) is rebuilt by adding, to apredictive block P_(b) associated with the correction block V_(b), theprediction residue Res^(q) _(b) ^(rec) associated with the current blockX which has been decoded from the encoded data stream STR.

At a step E54, it is verified that all the blocks of the image to bedecoded have been decoded and rebuilt. If not (N), the decoding methodresumes at the step E50 in carrying out the selection of the next blockaccording to a predetermined scanning of the image to be decoded.

If all the blocks of the image have been processed (Y), then at a stepE55, an image I_(k) ^(rec) is rebuilt from the rebuilt blocks X^(rec)and saved in a list of reference images to be used subsequently asreferences during the decoding of the following images in the imagesequence.

The encoding and decoding methods described here above can be integratedinto standard video encoders/decoders such as devices using the H.266,HEVC/H.265, AVC/H.264 standards or any type of proprietary videoencoder/decoder. The encoding and decoding methods according to theinvention apply also to all types of fixed image encoders/decoders andmore generally signal encoders/decoders using a blockwise predictiveencoding.

The encoding and decoding methods have been described here above in thecase of spatial blockwise encoding (intra encoding of an image). Thesemethods easily apply in the case of images encoded according to othertypes of encoding modes, for example inter encoding modes, in which onlycertain blocks can be encoded by spatial prediction.

6.5 Encoding Device

FIG. 6 represents the simplified structure of an encoding device CODadapted for implementing the encoding method according to any one of theparticular embodiments of the invention.

According to one particular embodiment of the invention, the steps ofthe encoding method are implemented by computer program instructions. Tothis end, the encoding device COD has the classic architecture of acomputer and comprises especially a memory MEM, a processing unit UT,equipped for example with a processor PROC and managed by the computerprogram PG stored in the memory MEM. The computer program PG comprisesinstructions to implement the steps of the encoding method as describedhere above when the program is executed by the processor PROC.

At initialization, the computer program code instructions PG are forexample loaded into a memory RAM and then executed by the processorPROC. The processor PROC of the processing unit UT implements notablythe steps of the encoding method described here above according to theinstructions of the computer program PG.

According to another particular embodiment of the invention, theencoding method is implemented by functional modules. To this end, theencoding device COD furthermore comprises:

-   -   a prediction module PRED configured to determine a predictive        block for a current block of an image to be encoded, the        prediction module PRED being also configured for the following:        -   for at least one first pixel of the current block:            -   obtaining a prediction value of said first pixel from at                least one pixel of a previously rebuilt block of the                image,            -   correcting the first pixel by adding at least one value                of a pixel of a block, called a correction block, to the                prediction value obtained for said first pixel,        -   for at least one pixel of the current block:            -   obtaining a prediction value of said current block from                at least one previously corrected pixel of the current                block,            -   correcting said current pixel by adding at least one                value of a pixel of said current block to the prediction                value obtained for the current pixel,    -   an encoding module CD adapted to the encoding, in the encoded        data stream, of at least one piece of information representative        of said correction block and a residual block computed from said        current block and said determined predictive block.

The processing unit UT is configured to compute the residual block fromthe current block and from the determined predictive block.

The processing unit UT cooperates with the different functional modulesdescribed here above and the memory MEM in order to implement the stepsof the encoding method.

The different functional modules described here above can be in hardwareform and/or software form. In hardware form, such a functional modulecan include a processor, a memory, and a program code instructions toimplement the function corresponding to the module when the codeinstructions are executed by the processor. In hardware form, such afunctional module can be implemented by any type of adapted encodingcircuit such as for example and non-exhaustively, microprocessors,digital signal processors (DSPs), applications specific integratedcircuits (ASICs), field programmable gate arrays (FPGA) circuits, awiring of logic units, etc.

6.6 Decoding Device

FIG. 7 represents the simplified structure of an decoding device DECadapted for implementing the decoding method according to any one of theparticular embodiments of the invention.

According to one particular embodiment of the invention, the decodingdevice DEC has the classic architecture of a computer and comprisesnotably a memory MEM0, a processing unit UT0, equipped for example witha processor PROC0 and managed by the computer program PG0 stored inmemory MEM0. The computer program PG0 comprises instructions toimplement the steps of the decoding method as described here above whenthe program is executed by the processor PROC0.

At initialization, the computer program code instructions PG0 are forexample loaded into a memory RAM and then executed by the processorPROC0. The processor PROC0 of the processing unit UT0 implements notablythe steps of the decoding method described here above according to theinstructions of the computer program PG0.

According to another particular embodiment of the invention, thedecoding method is implemented by functional modules. To this end, thedecoding device DEC further comprises:

-   -   decoding module DC configured, for at least one current block of        an image to be rebuilt, to decode at least one piece of        information representative of a block, called a correction        block, and a residual block from the encoded data stream.    -   a module for determining DET configured to determine the        correction block from the decoded piece of information,    -   a prediction module PRED0 configured to determine a predictive        block of the current block, the prediction module PRED0 being        configured:        -   for at least one first pixel of the current block:            -   to obtain a prediction value of said first pixel from at                least one pixel of a previously rebuilt block of the                image,            -   correct the first pixel by adding, to the prediction                value obtained for said first pixel, at least one value                of a pixel of the correction block,        -   for at least one current pixel of the current block,            distinct from the first pixel,            -   obtaining a prediction value of said current pixel from                at least one previously corrected pixel of the current                block,        -   correcting said current pixel by adding, to the prediction            value obtained for the current pixel, at least one value of            a pixel of the correction block,    -   a rebuilding module REC adapted to rebuilding said current block        from the predictive block and the residual block.

The processing unit UT0 cooperates with the different functional modulesdescribed here above and the memory MEM0 in order to implement the stepsof the decoding method.

The different functional modules described here above can be in hardwareand/or software form. In software form, such a functional module caninclude a processor, a memory and program code instructions to implementthe function corresponding to the module when the code instructions areexecuted by the processor. In hardware form, such a module can beimplemented by any type of adapted decoding circuits such as forexample, non-exhaustively, microprocessors, digital signal processors,applications specific integrated circuits (ASICs), Field ProgrammableGate Arrays (FPGAs), a wiring of logic units.

What is claimed is:
 1. A method comprising: decoding an encoded datastream representative of at least one image, said image beingsub-divided into blocks, the decoding comprising the following actsperformed by a decoding device for at least one block of the image,called a current block: decoding, from the encoded data stream: at leastone piece of information representative of a correction block, thecorrection block comprising correction values, and a residual block,which is different from the correction block and comprises residualdata, determining the correction block from the decoded piece ofinformation representative of the correction block, determining at leastfrom the correction block a predictive block for predicting the currentblock, comprising: for at least one current pixel of the current block:obtaining a prediction value of said current pixel from at least oneprediction value of another pixel of the current block, correcting saidprediction value obtained for the current pixel by adding, to saidprediction value obtained for the current pixel, at least one correctionvalue of a pixel of the correction block, rebuilding said current blockfrom athe predictive block and the decoded residual data of saidresidual block, wherein the prediction value of said current pixel isobtained by applying a local prediction function to said at least oneprediction value of another pixel of the current block, said localprediction function being used for all the blocks of said image on whichsaid decoding act is performed.
 2. The method according to claim 1,wherein the correction block comprises predetermined values of pixels.3. The method according to claim 1, wherein the prediction value of thecurrent pixel is obtained as a function of the local prediction functionapplied to the pixel situated above the current pixel, to the pixelsituated to the left of the current pixel and to the pixel situated atthe top left of the current pixel.
 4. The method according to claim 3,wherein a piece of information representative of the local predictionfunction is decoded from the encoded data stream.
 5. The methodaccording to claim 1, wherein said at least one prediction value ofanother pixel of the current block is a value of a pixel preceding thecurrent pixel in the current block.
 6. The method according to claim 1,wherein the encoded data stream comprises, for the current block, apiece of information indicating whether the current block is encodedaccording to a prediction mode using only pixels belonging to previouslyrebuilt blocks of the image or whether the current block is encodedaccording to a prediction mode using at least one previously correctedpixel of the current block.
 7. The method according to claim 1, whereinsaid at least one piece of information representative of a correctionblock is the size of the correction block.
 8. The method according toclaim 1, wherein the current block is square or rectangular.
 9. Themethod according to claim 1, wherein the correction block has a sizeidentical to that of the current block.
 10. The method according toclaim 1, wherein, in said act of determining a predictive block, theobtaining of a prediction value and the correction of said predictionvalue are performed for each pixel of the current block.
 11. A methodcomprising: encoding at least one image in the form of an encoded datastream, said image being sub- divided into blocks, the encodingcomprising the following acts performed by an encoding device for atleast one block of the image to be encoded, called a current block:determining a predictive block for predicting the current block, the actof determining comprising: for at least one current pixel of the currentblock: obtaining a prediction value for said current pixel from at leastone prediction value of another pixel of the current block, correctingsaid prediction value obtained for the current pixel by adding, to saidprediction value obtained for the current pixel, at least one correctionvalue of a pixel of a correction block, said correction block comprisingcorrection values, encoding, in the data stream, at least one piece ofinformation representative of said correction block, computing residualdata of a residual block from said current block and said determinedpredictive block, encoding the residual data of said residual block inthe data stream, wherein the prediction value of said current pixel isobtained by applying a local prediction function to said at least oneprediction value of another pixel of the current block, said localprediction function being used for all the blocks of said image on whichsaid decoding act is performed.
 12. The method according to claim 11,wherein the correction block comprises predetermined values of pixels.13. The method according to claim 11, wherein the prediction value ofthe current pixel is obtained as a function of the local predictionfunction applied to the pixel situated above the current pixel, to thepixel situated to the left of the current pixel and to the pixelsituated at the top left of the current pixel.
 14. The method accordingto claim 13, wherein a piece of information representative of the localprediction function is decoded from the encoded data stream.
 15. Themethod according to claim 11, wherein said at least one prediction valueof another pixel of the current block is a value of a pixel precedingthe current pixel in the current block.
 16. The method according toclaim 11, wherein the encoded data stream comprises, for the currentblock, a piece of information indicating whether the current block isencoded according to a prediction mode using only pixels belonging topreviously rebuilt blocks of the image or whether the current block isencoded according to a prediction mode using at least one previouslycorrected pixel of the current block.
 17. The method according to claim11, wherein said at least one piece of information representative of acorrection block is the size of the correction block.
 18. A decodingdevice comprising: a processor; and a non-transitory computer-readablemedium comprising instructions stored thereon, which when executed bythe processor configure the decoding device to decode an encoded datastream representative of at least one image, said image beingsub-divided into blocks, the decoding comprising, for at least one blockof the image, called a current block: decoding, from the encoded datastream: at least one piece of information representative of a correctionblock, the correction block comprising correction values, and a residualblock, which is different from the correction block and comprisesresidual data, determining the correction block from the decoded pieceof information representative of the correction block, determining atleast from the correction block a predictive block for predicting thecurrent block, comprising: for at least one current pixel of the currentblock: obtaining a prediction value of said current pixel from at leastone prediction value of another pixel of the current block, correctingsaid prediction value obtained for the current pixel by adding, to saidprediction value obtained for the current pixel, at least one correctionvalue of a pixel of the correction block, rebuilding said current blockfrom athe predictive block and the decoded residual data of saidresidual block, wherein the prediction value of said current pixel isobtained by applying a local prediction function to said at least oneprediction value of another pixel of the current block, said localprediction function being used for all the blocks of said image on whichsaid decoding act is performed.
 19. An encoding device comprising: aprocessor; and a non-transitory computer-readable medium comprisinginstructions stored thereon, which when executed by the processorconfigure the encoding device to encode at least one image in the formof an encoded data stream, said image being sub-divided into blocks, theencoding comprising, for at least one block of the image to be encoded,called a current block: determining a predictive block for predictingthe current block, the act of determining comprising: for at least onecurrent pixel of the current block: obtaining a prediction value forsaid current pixel from at least one prediction value of another pixelof the current block, correcting said prediction value obtained for thecurrent pixel by adding, to said prediction value obtained for thecurrent pixel, at least one correction value of a pixel of a correctionblock, said correction block comprising correction values, encoding, inthe data stream, at least one piece of information representative ofsaid correction block, computing residual data of a residual block fromsaid current block and said determined predictive block, encoding theresidual data of said residual block in the data stream, wherein theprediction value of said current pixel is obtained by applying a localprediction function to said at least one prediction value of anotherpixel of the current block, said local prediction function being usedfor all the blocks of said image on which said decoding act isperformed.
 20. A non-transitory computer-readable medium comprising acomputer program stored thereon comprising instructions for implementinga method of decoding an encoded data stream representative of at leastone image, when the program is executed by a processor of a decodingdevice, said image being sub-divided into blocks, wherein theinstructions configure the decoding device to perform the following actsfor at least one block of the image, called a current block: decoding,from the encoded data stream: at least one piece of informationrepresentative of a correction block, the correction block comprisingcorrection values, and a residual block, which is different from thecorrection block and comprises residual data, determining the correctionblock from the decoded piece of information representative of thecorrection block, determining at least from the correction block apredictive block for predicting the current block, comprising: for atleast one current pixel of the current block: obtaining a predictionvalue of said current pixel from at least one prediction value ofanother pixel of the current block, correcting said prediction valueobtained for the current pixel by adding, to said prediction valueobtained for the current pixel, at least one correction value of a pixelof the correction block, rebuilding said current block from a-thepredictive block and the decoded residual data of said residual block,wherein the prediction value of said current pixel is obtained byapplying a local prediction function to said at least one predictionvalue of another pixel of the current block, said local predictionfunction being used for all the blocks of said image on which saiddecoding act is performed.
 21. A non-transitory computer-readable mediumcomprising a computer program stored thereon comprising instructions forimplementing a method of encoding at least one image in the form of anencoded data stream, when the program is executed by a processor of anencoding device, said image being sub-divided into blocks, wherein theinstructions configure the encoding device to perform the following actsfor at least one block of the image to be encoded, called a currentblock: determining a predictive block for predicting the current block,the act of determining comprising: for at least one current pixel of thecurrent block: obtaining a prediction value for said current pixel fromat least one prediction value of another pixel of the current block,correcting said prediction value obtained for the current pixel byadding, to said prediction value obtained for the current pixel, atleast one correction value of a pixel of a correction block, saidcorrection block comprising correction values, encoding, in the datastream, at least one piece of information representative of saidcorrection block, computing residual data of a residual block from saidcurrent block and said determined predictive block, encoding theresidual data of said residual block in the data stream wherein theprediction value of said current pixel is obtained by applying a localprediction function to said at least one prediction value of anotherpixel of the current block, said local prediction function being usedfor all the blocks of said image on which said decoding act isperformed.